Ant colony optimization for Cuckoo Search algorithm for permutation flow shop scheduling problem
نویسندگان
چکیده
منابع مشابه
An ant colony optimization algorithm for job shop scheduling problem
The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm known as Elitist Ant System (EAS), applied to a combinatorial optimization problem called Job Shop S...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملAn Efficient Ant Colony Optimization Algorithm for Multiobjective Flow Shop Scheduling Problem
In this paper an ant colony optimization algorithm is developed to solve the permutation flow shop scheduling problem. In the permutation flow shop scheduling problem which has been vastly studied in the literature, there are a set of machines and a set of jobs. All the jobs are processed on all the machines and the sequence of jobs being processed is the same on all the machines. Here this pro...
متن کاملAnt Colony Optimization for Job Shop Scheduling Problem
This paper presents an application of the Ant colony optimization metaheuristic to the job shop scheduling problem. A pheromone alteration strategy which improves the basic ant system by utilizing the behaviour of artificial ants to perform local search is introduced. Experiments using well-known benchmark JSSP problems show that this approach improves on the performance obtained by the basic a...
متن کاملAn Effective Hybrid Ant Colony Optimization for Permutation Flow-Shop Scheduling
This paper proposes a hybrid ant colony optimization algorithm to solve the permutation flow-shop scheduling (PFS). The hybridization of ant colony optimization (ACO) with path relinking (PR), which combines the advantages of two individual algorithms, is the key innovative aspect of the approach. Path relinking (PR) can be interpreted as an evolutionary method where the high quality solutions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems Science & Control Engineering
سال: 2018
ISSN: 2164-2583
DOI: 10.1080/21642583.2018.1555063